Connected Components inO(log3/2n) Parallel Time for the CREW PRAM
نویسندگان
چکیده
منابع مشابه
Connected Components in O(log 3=2 N) Parallel Time for the Crew Pram N) Time
Finding the connected components of an undirected graph G = (V;E) on n = jV j vertices and m = jEj edges is a fundamental computational problem. The best known parallel algorithm for the CREW PRAMmodel runs inO(log2 n) time using n2= log2 n processors [6, 15]. For the CRCW PRAM model, in which concurrent writing is permitted, the best known algorithm runs in O(log n) time using slightly more th...
متن کاملConnected Components in O(\lg^3/2 |V|) Parallel Time for the CREW PRAM
Finding the connected components of an undirected graph G V E on n jV j vertices and m jEj edges is a fundamental computational problem The best known parallel algorithm for the CREW PRAMmodel runs inO log n time using n log n processors For the CRCW PRAM model in which concurrent writing is permitted the best known algorithm runs in O log n time using slightly more than n m log n processors Si...
متن کاملA Cost Optimal Parallel Quicksort on CREW PRAM
In this paper we introduce a cost optimal parallel quicksort algorithm. It sorts an array of n elements in O(log n) time using O( n n log ) processors on a CREW PRAM. That is, the total cost is O(n log n), the same as an average sequential quicksort algorithm. The key feature of the proposed algorithm is that it partitions the array concurrently. This removes the performance bottleneck proposed...
متن کاملAnother Pram Algorithm for Finding Connected Components of Sparse Graphs
We present an algorithm which exploits a new approach to the problem of nding the connected components of an undirected graph, CCug for short, with v vertices and e edges. The algorithm has depth O(log 2 (e)) 1 on a CREW PRAM using e processors, hence its cost is not aaected by the number v of graph vertices. This makes the algorithm the one with best speedup and best cost for CCug on highly sp...
متن کاملOptimal Parallel Two Dimensional Text Searching on a CREW PRAM
We present a parallel algorithm for two dimensional text searching over a general alphabet. This algorithm is optimal in two ways. First, the total number of operations on the text is linear. Second, the algorithm takes time O(log m) on a CREW PRAM (where m is the length of the longest dimension of the pattern), thus matching the lower bound for string matching on a PRAM without concurrent writ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1997
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1291